Double Bubbles on the Line with Log-Convex Density $f$ with $(\log f)'$ Bounded
نویسندگان
چکیده
منابع مشابه
Globally F -regular and Log Fano Varieties
We prove that every globally F -regular variety is log Fano. In other words, if a prime characteristic variety X is globally F -regular, then it admits an effective Qdivisor ∆ such that −KX −∆ is ample and (X, ∆) has controlled (Kawamata log terminal, in fact globally F -regular) singularities. A weak form of this result can be viewed as a prime characteristic analog of de Fernex and Hacon’s ne...
متن کاملConvex Hull with Optimal Query Time and O ( log n · log log n ) Update Time
The dynamic maintenance of the convex hull of a set of points in the plane is one of the most important problems in computational geometry. We present a data structure supporting point insertions in amortized O(log n · log log logn) time, point deletions in amortized O(log n · log logn) time, and various queries about the convex hull in optimal O(log n) worst-case time. The data structure requi...
متن کاملLog-loss games with bounded adversaries
Worst-case analysis of the game assumes, by definition, that the adversary is trying to minimize the learner’s regret without any restrictions on the resources it uses while doing so. In practice, however, it may not be necessary (or indeed desirable) to get bounds of this kind—real-world data are typically generated by processes of bounded computational power, memory, etc., and it would be use...
متن کاملAn O(n)-space O(log N= Log Log N + F )-query Time Algorithm for 3-d Dominance Reporting
We present a linear-space algorithm for handling the three-dimensional dominance reporting problem: given a set S of n three-dimensional points, design a data structure for S so that the points in S which dominate a given query point can be reported quickly. Under the variation of the RAM model introduced by Fredman and Willard 8], our algorithm achieves O(log n= loglog n + f) query time, where...
متن کاملMixed f - divergence and inequalities for log concave functions ∗
Mixed f -divergences, a concept from information theory and statistics, measure the difference between multiple pairs of distributions. We introduce them for log concave functions and establish some of their properties. Among them are affine invariant vector entropy inequalities, like new Alexandrov-Fenchel type inequalities and an affine isoperimetric inequality for the vector form of the Kull...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Missouri Journal of Mathematical Sciences
سال: 2018
ISSN: 0899-6180
DOI: 10.35834/mjms/1544151693